A feasible descent bundle method for inequality constrained Minimax problems
نویسندگان
چکیده
منابع مشابه
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
In this paper, by means of the concept of the working set, which is an estimate of the active set, we propose a feasible sequential linear equation algorithm for solving inequality constrained optimization problems. At each iteration of the proposed algorithm, we first solve one system of linear equations with a coefficient matrix of size m × m (where m is the number of constraints) to compute ...
متن کاملFeasible descent algorithms for mixed complementarity problems
In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-defined for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This fra...
متن کاملA feasible directions method on combining feasibility with descent for nonlinear constrained optimization
Abstract. In this paper, a modified gradient projection method is proposed to solve the nonlinear constrained optimization problems, where the search direction is obtained by combing feasibility with descent. In addition, it is pointed out that, for linear constrained optimization problems, this method may be simplified and viewed as the modified version to Rosen’s method. The theoretical analy...
متن کاملDirect search based on probabilistic feasible descent for bound and linearly constrained problems
Direct search is a methodology for derivative-free optimization whose iterations are characterized by evaluating the objective function using a set of polling directions. In deterministic direct search applied to smooth objectives, these directions must somehow conform to the geometry of the feasible region and typically consist of positive generators of approximate tangent cones (which then re...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Mathematica
سال: 2015
ISSN: 1674-7216
DOI: 10.1360/n012015-00022